package morpion;

import java.util.LinkedList;

public class Arete{
	double poids;
	int nom;
	Sommet entrant,sortant;
	
	public static Arete find(LinkedList<Arete> list, int entrant, int sortant) //entrant-sortant cf lydie
	{
		for(int i = 0; i < list.size(); i++) if (list.get(i).entrant.nom == entrant && list.get(i).sortant.nom == sortant) return list.get(i);
		
		return null;
	}
	
	public Arete(int nom, Sommet e, Sommet s,double p){
		this.nom=nom;
		poids=p;
		entrant=e;
		sortant=s;
	}
}